On the spectral radius of bicyclic graphs with n vertices and diameter d

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the spectral radius of bicyclic graphs with n vertices and diameter d

Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. In this paper we determine the graph with the largest spectral radius among all bicyclic graphs with n vertices and diameter d. As an application, we give first three graphs among all bicyclic graphs on n vertices, ordered according to their spectral radii in decreasing order. © 2006 Elsevi...

متن کامل

The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50

متن کامل

On the Spectral Radius of Bicyclic Graphs

A b s t r a c t. Let K3 and K ′ 3 be two complete graphs of order 3 with disjoint vertex sets. Let B∗ n(0) be the 5-vertex graph, obtained by identifying a vertex of K3 with a vertex of K ′ 3 . Let B∗∗ n (0) be the 4-vertex graph, obtained by identifying two vertices of K3 each with a vertex of K ′ 3 . Let B∗ n(k) be graph of order n , obtained by attaching k paths of almost equal length to the...

متن کامل

The spectral radius of tricyclic graphs with n vertices and k pendent vertices

In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35

متن کامل

On the Spectral Radius of Graphs with Cut Vertices

The graphs in this paper are simple. The spectral radius, \(G), of a graph G is the largest eigenvalue of its adjacency matrix A(G). For results on the spectral radii of graphs, the reader is referred to [3, 4, 6] and the references therein. When G is connected, A(G) is irreducible and by the Perron Frobenius Theorem, e.g., [1], the spectral radius is simple and has a unique (up to a multiplica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2007

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.09.011